A Polyhedral Method for Solving Sparse Polynomial Systems
نویسندگان
چکیده
A continuation method is presented for computing all isolated roots of a semimixed sparse system of polynomial equations. We introduce mixed subdivisions of Newton polytopes, and we apply them to give a new proof and algorithm for Bernstein's theorem on the expected number of roots. This results in a numerical homotopy with the optimal number of paths to be followed. In this homotopy there is one starting system for each cell of the mixed subdivision, and the roots of these starting systems are obtained by an easy combinatorial construction.
منابع مشابه
A Polyhedral Method to Compute All Affine Solution Sets of Sparse Polynomial Systems
To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible decomposition of a variety is typically understood in affine space, including also those components with zero coordinates. We present a polyhedral method to compute ...
متن کاملWhy Polyhedra Matter in Non-Linear Equation Solving
We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and assume no background in algebraic geometry. Highlights include the following: (1) A completely self-contained proof of an extension of Bernstein’s Theorem. Our extension relates volumes of polytopes with the...
متن کاملRegeneration homotopies for solving systems of polynomials
We present a new technique, based on polynomial continuation, for solving systems of n polynomials in N complex variables. The method allows equations to be introduced one-by-one or in groups, obtaining at each stage a representation of the solution set that can be extended to the next stage until finally obtaining the solution set for the entire system. At any stage where positive dimensional ...
متن کاملBoundary-element-based Finite Element Methods for Helmholtz and Maxwell Equations on General Polyhedral Meshes
We present new finite element methods for Helmholtz and Maxwell equations for general three-dimensional polyhedral meshes, based on domain decomposition with boundary elements on the surfaces of the polyhedral volume elements. The methods use the lowest-order polynomial spaces and produce sparse, symmetric linear systems despite the use of boundary elements. Moreover, piecewise constant coeffic...
متن کاملConstructing Polyhedral Homotopies on Grid-of-Clusters
Polyhedral homotopy continuation is a promising approach to solving large-scale polynomial systems. However, the method faces a computational bottleneck in constructing the homotopy functions because we need to find all mixed cells for polynomial systems. The search for mixed cells can be formulated as a vertex enumeration problem for polyhedra. Among the search methods for solving the problem ...
متن کامل